Quasi-Weak Cost Automata: A New Variant of Weakness

Cost automata have a finite set of counters which can be manipulated on each transition but do not affect control flow. Based on the evolution of the counter values, these automata define functions from a domain like words or trees to N ∪ {∞}, modulo an equivalence relation which ignores exact values but preserves boundedness properties. These automata have been studied by Colcombet et al. as part of a “theory of regular cost functions”, an extension of the theory of regular languages which retains robust equivalences, closure properties, and decidability like the classical theory. We extend this theory by introducing quasi-weak cost automata. Unlike traditional weak automata which have a hard-coded bound on the number of alternations between accepting and rejecting states, quasi-weak automata bound the alternations using the counter values (which can vary across runs). We show that these automata are strictly more expressive than weak cost automata over infinite trees. The main result is a Rabin-style characterization theorem: a function is quasi-weak definable if and only if it is definable using two dual forms of nondeterministic Büchi cost automata. This yields a new decidability result for cost functions over infinite trees. 1998 ACM Subject Classification F.1.1 Models of Computation